0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-ho \
0.00/0.00	  --no-avatar \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2 \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n066.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:19:39 CST 2018
0.00/0.21	% done 26 iterations in 0.006s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(notinself, conjecture,
0.00/0.21	  (foundationAx =>
0.00/0.21	   (setadjoinIL => (uniqinunit => (in__Cong => (![A]: (~in(A,A)))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (foundationAx =>
0.00/0.21	     (setadjoinIL => (uniqinunit => (in__Cong => (![A]: (~in(A,A))))))))).
0.00/0.21	tff('0', plain, in(sk_A2, sk_A2),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff(setadjoinIL, axiom,
0.00/0.21	  (setadjoinIL <=> (![Xx,Xy]: in(Xx,setadjoin(Xx,Xy))))).
0.00/0.21	tff('1', plain, ![X4, X5]: (in(X4, setadjoin(X4, X5)) | ~ setadjoinIL),
0.00/0.21	    inference('cnf', [status(esa)], [setadjoinIL])).
0.00/0.21	tff('2', plain, setadjoinIL, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('3', plain, ![X4, X5]: (in(X4, setadjoin(X4, X5)) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['1', '2'])).
0.00/0.21	tff('4', plain, ![X4, X5]: in(X4, setadjoin(X4, X5)),
0.00/0.21	    inference('simplify', [status(thm)], ['3'])).
0.00/0.21	tff(foundationAx, axiom,
0.00/0.21	  (foundationAx <=>
0.00/0.21	   (![A]:
0.00/0.21	      ((?[Xx]: in(Xx,A)) =>
0.00/0.21	       (?[B]: ((~(?[Xx]: (in(Xx,A) & in(Xx,B)))) & in(B,A))))))).
0.00/0.21	tff('5', plain,
0.00/0.21	    ![X0, X1]: (~ in(X0, X1) | in(sk_B(X1), X1) | ~ foundationAx),
0.00/0.21	    inference('cnf', [status(esa)], [foundationAx])).
0.00/0.21	tff('6', plain, foundationAx, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('7', plain, ![X0, X1]: (~ in(X0, X1) | in(sk_B(X1), X1) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['5', '6'])).
0.00/0.21	tff('8', plain, ![X0, X1]: (in(sk_B(X1), X1) | ~ in(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['7'])).
0.00/0.21	tff('9', plain,
0.00/0.21	    ![X0, X1]: (~ $true | in(sk_B(setadjoin(X1, X0)), setadjoin(X1, X0))),
0.00/0.21	    inference('sup-', [status(thm)], ['4', '8'])).
0.00/0.21	tff('10', plain, ![X0, X1]: in(sk_B(setadjoin(X1, X0)), setadjoin(X1, X0)),
0.00/0.21	    inference('simplify', [status(thm)], ['9'])).
0.00/0.21	tff(uniqinunit, axiom,
0.00/0.21	  (uniqinunit <=> (![Xx,Xy]: (in(Xx,setadjoin(Xy,emptyset)) => (Xx = Xy))))).
0.00/0.21	tff('11', plain,
0.00/0.21	    ![X6, X7]: (~ in(X6, setadjoin(X7, emptyset)) | X6 = X7 | ~ uniqinunit),
0.00/0.21	    inference('cnf', [status(esa)], [uniqinunit])).
0.00/0.21	tff('12', plain, uniqinunit, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('13', plain,
0.00/0.21	    ![X6, X7]: (~ in(X6, setadjoin(X7, emptyset)) | X6 = X7 | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['11', '12'])).
0.00/0.21	tff('14', plain, ![X6, X7]: (X6 = X7 | ~ in(X6, setadjoin(X7, emptyset))),
0.00/0.21	    inference('simplify', [status(thm)], ['13'])).
0.00/0.21	tff('15', plain, ![X0]: (~ $true | sk_B(setadjoin(X0, emptyset)) = X0),
0.00/0.21	    inference('sup-', [status(thm)], ['10', '14'])).
0.00/0.21	tff('16', plain, ![X0]: sk_B(setadjoin(X0, emptyset)) = X0,
0.00/0.21	    inference('simplify', [status(thm)], ['15'])).
0.00/0.21	tff('17', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (~ in(X0, X1) | ~ in(X2, sk_B(X1)) | ~ in(X2, X1) | ~ foundationAx),
0.00/0.21	    inference('cnf', [status(esa)], [foundationAx])).
0.00/0.21	tff('18', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (~ in(X0, X1) | ~ in(X2, sk_B(X1)) | ~ in(X2, X1) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['17', '6'])).
0.00/0.21	tff('19', plain,
0.00/0.21	    ![X0, X1, X2]: (~ in(X2, X1) | ~ in(X2, sk_B(X1)) | ~ in(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['18'])).
0.00/0.21	tff('20', plain, ![X0, X1]: (~ in(X1, X0) | ~ in(X1, sk_B(X0))),
0.00/0.21	    inference('condensation', [status(thm)], ['19'])).
0.00/0.21	tff('21', plain,
0.00/0.21	    ![X0, X1]: (~ in(X1, X0) | ~ in(X1, setadjoin(X0, emptyset))),
0.00/0.21	    inference('sup-', [status(thm)], ['16', '20'])).
0.00/0.21	tff('22', plain, ![X0]: (~ $true | ~ in(X0, X0)),
0.00/0.21	    inference('sup-', [status(thm)], ['4', '21'])).
0.00/0.21	tff('23', plain, ![X0]: ~ in(X0, X0),
0.00/0.21	    inference('simplify', [status(thm)], ['22'])).
0.00/0.21	tff('24', plain, ~ $true, inference('sup-', [status(thm)], ['0', '23'])).
0.00/0.21	tff('25', plain, $false, inference('simplify', [status(thm)], ['24'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
